A polynomial matrix method for computing stable rational doubly coprime factorizations
نویسنده
چکیده
This paper proposes a new method for computing stable rational doubly coprime factorizations from a given transfer matrix. In contrast to the well-known method which requires a state space representation, the proposed method makes full use of polynomial matrices, and the whole operation is carried out directly in the frequency domain. Furthermore, the paper clarifies the meaning of the obtained factorization as a controller by showing that this factorization coincides with the one by the state space method for a suitable choice of feedback and observer gains.
منابع مشابه
Minimal Degree Coprime Factorization of Rational Matrices
Given a rational matrix G with complex coefficients and a domain Γ in the closed complex plane, both arbitrary, we develop a complete theory of coprime factorizations of G over Γ, with denominators of McMillan degree as small as possible. The main tool is a general pole displacement theorem which gives conditions for an invertible rational matrix to dislocate by multiplication a part of the pol...
متن کامل“Stabilizing” the stabilizing controllers
The main purpose of this paper is to revisit the internal/simultaneous/robust stabilization problems without assuming the existence of doubly coprime factorizations for the transfer matrices. Indeed, it has been recently shown in the literature that an internally stabilizable does not generally admit doubly coprime factorizations. Firstly, we give new necessary and sufficient conditions for int...
متن کاملComputation of Normalized Coprime Factorizations of Rational Matrices
We propose a new computational approach based on descriptor state space algorithms for computing normalized coprime factorizations of arbitrary rational matrices. The proposed approach applies to both continuousand discrete-time rational transfer-function matrices and shows that each rational matrix possesses a normalized coprime factorization with proper factors. The new method is conceptually...
متن کاملGeneralized Schur Methods to Compute Coprime Factorizations of Rational Matrices
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices factorizations with least order denominators factorizations with inner denominators and factorizations with proper stable factors The new algorithms are based on a recursive generalized Schur algorithm for pole assignment They are generally applicable regardles...
متن کاملRational and Polynomial Matrices
where λ = s or λ = z for a continuousor discrete-time realization, respectively. It is widely accepted that most numerical operations on rational or polynomial matrices are best done by manipulating the matrices of the corresponding descriptor system representations. Many operations on standard matrices (such as finding the rank, determinant, inverse or generalized inverses, nullspace) or the s...
متن کامل